Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata
نویسندگان
چکیده
Unary self-verifying symmetric difference automata have a known tight bound of [Formula: see text] for their state complexity. We now consider the non-unary case and show that, every text], there is regular language accepted by nondeterministic automaton with states, such that its equivalent minimal deterministic finite has states. Furthermore, given any SV-XNFA it possible, up to isomorphism, find at most another SV-XNFA. Finally, we certain set SV-XNFA, on
منابع مشابه
Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata
Previously, self-verifying symmetric difference automata were defined and a tight bound of 2n−1−1 was shown for state complexity in the unary case. We now consider the non-unary case and show that, for every n≥ 2, there is a regular languageLn accepted by a non-unary self-verifying symmetric difference nondeterministic automaton with n states, such that its equivalent minimal deterministic fini...
متن کاملDescriptional Complexity of Ambiguity in Symmetric Difference NFAs
We investigate ambiguity for symmetric difference nondeterministic finite automata. We show the existence of unambiguous, finitely ambiguous, polynomially ambiguous and exponentially ambiguous symmetric difference nondeterministic finite automata. We show that, for each of these classes, there is a family of n-state nondeterministic finite automata such that the smallest equivalent deterministi...
متن کاملUnary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds
It is well known that a context-free language defined over a one-letter alphabet is regular. This implies that unary context-free grammars and unary pushdown automata can be transformed into equivalent finite automata. In this paper, we study these transformations from a descriptional complexity point of view. In particular, we give optimal upper bounds for the number of states of nondeterminis...
متن کاملAutomaticity II: Descriptional Complexity in the Unary Case
Let Z and d be finite alphabets, and let f be a map from C* to A. Then the deterministic automaticity of f, &(n), is defined to be the size of the minimum finite-state machine that correctly computes f on all inputs of size <n. A similar definition applies to languages L. We denote the nondeterministic analogue (for languages L) of automaticity by NL(~). In a previous paper, Shallit and Breitba...
متن کاملAmbiguity of Unary Symmetric Difference NFAs
Okhotin [9] showed an exponential trade-off in the conversion from nondeterministic unary finite automata to unambiguous nondeterministic unary finite automata. In this paper, we consider the trade-off in the case of unary symmetric difference finite automata to finitely ambiguous unary symmetric difference finite automata. Surprisingly, the trade-off is linear in the number of states of the fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2022
ISSN: ['1793-6373', '0129-0541']
DOI: https://doi.org/10.1142/s0129054122410076